Analysis of Piecewise Linear Systems via Convex Optimization – a Unifying Approach
نویسنده
چکیده
The recently developed technique for computation of piecewise quadratic Lyapunov functions is specialized to Lyapunov functions that are piecewise linear. This establishes a unified framework for computation of quadratic, piecewise quadratic, piecewise linear and polytopic Lyapunov functions. The search for a piecewise linear Lyapunov function is formulated as a linear programming problem, and duality is used to address the non-trivial issue of partition refinements.
منابع مشابه
Computational Methods for Hybrid Systems
This paper reports the development of a Matlab toolbox for computational analysis of piecewise linear systems. The analysis is based on piecewise quadratic Lyapunov functions, which are computed via convex optimization. In this way, exponential stability and system performance can be assessed. The toolbox also supports efficient simulation of systems with discontinuous dynamics and sliding mode...
متن کاملLinear Time Varying MPC Based Path Planning of an Autonomous Vehicle via Convex Optimization
In this paper a new method is introduced for path planning of an autonomous vehicle. In this method, the environment is considered cluttered and with some uncertainty sources. Thus, the state of detected object should be estimated using an optimal filter. To do so, the state distribution is assumed Gaussian. Thus the state vector is estimated by a Kalman filter at each time step. The estimation...
متن کاملA duality-based convex optimization approach to L2 -gain control of piecewise affine slab differential inclusions
This paper introduces the dual parameter set of a piecewise affine (PWA) system. This is a key concept to enable a convex formulation of PWA controller synthesis for PWA slab differential inclusions using a new convex relaxation. Another important contribution of the paper is to present PWA L2-gain analysis and synthesis results for PWA systems whose output is also a PWA function of the state (...
متن کاملConvex parametric piecewise quadratic optimization: Theory, Algorithms and Control Applications
In this paper we study the problem of parametric minimization of convex piecewise quadratic functions. Our study provides a unifying framework for convex parametric quadratic and linear programs. Furthermore, it extends parametric programming algorithms to problems with piecewise quadratic cost functions, paving the way for new applications of parametric programming in dynamic programming and o...
متن کاملComputation of Piecewise Quadratic Lyapunov Functions for Hybrid Systems - Automatic Control, IEEE Transactions on
This paper presents a computational approach to stability analysis of nonlinear and hybrid systems. The search for a piecewise quadratic Lyapunov function is formulated as a convex optimization problem in terms of linear matrix inequalities. The relation to frequency domain methods such as the circle and Popov criteria is explained. Several examples are included to demonstrate the flexibility a...
متن کامل